Fibration-defined integer and non-integer axes
نویسندگان
چکیده
منابع مشابه
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today that is the use of branch and bound to handle discrete constructs, which, while often formally representable in terms of zero-one integer variables, can be handled more elegantly and effectively by applying branch and boun...
متن کاملProbing Non-Integer Dimensions
Suppose that the velocity field is inversely proportional to the radial distance, v = Q 2πr . Such a divergenceless field is natural in two dimensions and is generated by a point sink (or source) of strength Q in an incompressible fluid. This flow field has the remarkable property that the convection term can be absorbed into the diffusion operator by an appropriate shift of the spatial dimensi...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملInteger Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
We call a matrix A nearly totally unimodular if it can be obtained from a totally unimodular matrix à by adding to each row of à an integer multiple of some fixed row a of Ã. For an integer vector b and a nearly totally unimodular matrix A, we denote by PA,b the integer hull of the set {x ∈ R | Ax ≤ b}. We show that PA,b has the integer decomposition property and that we can find a decompositio...
متن کاملGeneralised Integer Programming Based on Logically Defined Relations
Many combinatorial optimisation problems can be modelled as integer linear programs. We consider a class of generalised integer programs where the constraints are allowed to be taken from a broader set of relations (instead of just being linear inequalities). The set of allowed relations is defined using a many-valued logic and the resulting class of relations have provably strong modelling pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A Foundations of Crystallography
سال: 2005
ISSN: 0108-7673
DOI: 10.1107/s010876730508027x